Dynamic critical index of the Swendsen–Wang algorithm by dynamic finite-size scaling
نویسندگان
چکیده
منابع مشابه
Dynamic critical index of the Swendsen-Wang algorithm by dynamic finite-size scaling
In this work we have considered the dynamic scaling relation of the magnetization in order to study the dynamic scaling behavior of 2and 3-dimensional Ising models. We have used the literature values of the magnetic critical exponents to observe the dynamic finite-size scaling behavior of the time evolution of the magnetization during early stages of the Monte Carlo simulation. In this way we h...
متن کاملA study of dynamic finite size scaling behavior of the scaling functions - calculation of dynamic critical index of Wolff algorithm
In this work we have studied the dynamic scaling behavior of two scaling functions and we have shown that scaling functions obey the dynamic finite size scaling rules. Dynamic finite size scaling of scaling functions opens possibilities for a wide range of applications. As an application we have calculated the dynamic critical exponent (z) of Wolff’s cluster algorithm for 2-, 3and 4-dimensional...
متن کاملA New Measurement of Dynamic Critical exponent of Wolff Algorithm by Dynamic Finite Size Scaling
In this work we have calculated the dynamic critical exponent z for 2-, 3and 4-dimensional Ising models using the Wolff’s algorithm through dynamic finite size scaling. We have studied time evolution of the average cluster size, the magnetization and higher moments of the magnetization. It is observed that dynamic scaling is independent of the algorithm. In this sense, universality is establish...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولFinite size scaling approach to dynamic storage allocation problem
It is demonstrated how dynamic storage allocation algorithms can be analyzed in terms of finite size scaling. The method is illustrated in the three simple cases of the first-fit, next-fit and best-fit algorithms, and the system works at full capacity. The analysis is done from two different points of view running speed and employed memory. In both cases, and for all algorithms, it is shown tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2006
ISSN: 0010-4655
DOI: 10.1016/j.cpc.2006.07.007